Perormance Of Different Cooperative Routing Algorithms In Wireless Networks

Each node in the network is equipped with a single omnidirectional antenna and motivated by the large body of physical layer research indicating its potential utility, that multiple nodes are able to coordinate their transmissions at the physical layer in order to take advantage of spatial diversity. Such coordination, however, is intrinsically intertwined with routing decisions, thus motivating the work. The problem of finding minimum–energy cooperative routes in a wireless network with variable wireless channels. I first formulate the energy cost of forming a cooperative link between two nodes based on a two-stage transmission strategy assuming that only statistical knowledge about channels is available. Utilizing the link cost formulation, optimal static routes in a network can be computed by running Dijkstra’s algorithm over an extended network graph created by cooperative link. However, due to the variability of wireless channels, a many-to-many cooperative model in static routing is suboptimal. Hence, an opportunistic routing algorithm based on many-to-many cooperation, is to be developed and optimal routes in a network can be computed by a stochastic version of the BellmanFord algorithm. Static and opportunistic optimal algorithms as baselines to develop heuristic link selection algorithms that are energy efficient while being computationally simpler than the optimal algorithms. Energy saving can be achieved through simple heuristics which are computationally efficient. Keywords— Cooperative communication, minimum energy routing, variable wireless channels.